Belief propagation and turbo code: Information geometrical view
نویسندگان
چکیده
In this article, we describe the information geometrical understanding of the belief propagation decoder, especially of the turbo decoding. The turbo decoding was proposed by Berrou et al. early in 90’s, and many studies have been appeared on this practical and powerful error correcting code. Even though many experimental results support the potential of the turbo decoding, there is not sufficient theoretical analysis for the decoding method. We investigate the problem from information geometrical viewpoint. From the new viewpoint, we establish a new framework for analyzing the turbo code, and reveal basic properties.
منابع مشابه
Information Geometrical Framework for Analyzing Belief Propagation Decoder
The mystery of belief propagation (BP) decoder, especially of the turbo decoding, is studied from information geometrical viewpoint. The loopy belief network (BN) of turbo codes makes it difficult to obtain the true “belief” by BP, and the characteristics of the algorithm and its equilibrium are not clearly understood. Our study gives an intuitive understanding of the mechanism, and a new frame...
متن کاملProbability propagation and decoding in analog VLSI
The sum-product algorithm (belief/probability propagation) can be naturally mapped into analog transistor circuits. These circuits enable the construction of analog-VLSI decoders for turbo codes, low-density parity-check codes, and similar codes.
متن کاملAn analysis of belief propagation on the turbo decoding graph with Gaussian densities
Motivated by its success in decoding turbo codes, we provide an analysis of the belief propagation algorithm on the turbo decoding graph with Gaussian densities. In this context, we are able to show that, under certain conditions, the algorithm converges and that – somewhat surprisingly – though the density generated by belief propagation may differ significantly from the desired posterior dens...
متن کاملTurbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm
In this paper, we will describe the close connection between the now celebrated iterative turbo decoding algorithm of Berrou et al. and an algorithm that has been well known in the artificial intelligence community for a decade, but which is relatively unknown to information theorists: Pearl’s belief propagation algorithm. We shall see that if Pearl’s algorithm is applied to the “belief network...
متن کاملInformation Geometry of Propagation Algorithms and Approximate Inference
Consider the inference problem of undirected graphical models[8, 9]. When the graph is tree, the Belief Propagation (BP) algorithm (J.Pearl[11]) is an efficient algorithm and the exact inference is computed. However, when the graph is “loopy,” and the loops are big, the exact inference becomes intractable. Besides sampling methods, such as MCMC, tractable approximate inference gives us one prac...
متن کامل